Phase Transitions of Plan Modification in Conformant Planning
نویسندگان
چکیده
We explore phase transitions of plan modification, which mainly focus on the conformant planning problems. By analyzing features of plan modification in conformant planning problems, quantitative results are obtained. If the number of operators is less than ub , almost all conformant planning problems can’t be solved with plan modification. If the number of operators is more than lb , almost all conformant planning problems can be solved with plan modification. The results of the experiments also show that there exists an experimental threshold c of density (ratio of number of operators to number of propositions), which separates the region where almost all conformant planning problems can’t be solved with plan modification from the region where almost all conformant planning problems can be solved with plan modification.
منابع مشابه
Conformant Graphplan
Planning under uncertainty is a difficult task. If sensory information is available, it is possible to do contingency planning – that is, develop plans where certain branches are executed conditionally, based on the outcome of sensory actions. However, even without sensory information, it is often possible to develop useful plans that succeed no matter which of the allowed states the world is a...
متن کاملPlanning in Belief Space with a Labelled Uncertainty Graph
Planning in belief space with a Labelled Uncertainty Graph, LUG, is an approach that uses a very compact planning graph to guide search in the space of belief states to construct conformant and contingent plans. A conformant plan is a plan that transitions (without sensing) all possible initial states through possibly non-deterministic actions to a goal state. A contingent plan adds the ability...
متن کاملFragment-based Conformant Planning
With complex systems such as spacecraft, we often need to achieve goals even though failures prevent the exact state of the system from being determined. Conformant planning is the problem of generating a plan that moves a system from any of a number of possible initial states to a goal state, given that actions may have uncertain outcomes and sensing is unavailable. Two existing approaches to ...
متن کاملMapping Conformant Planning into SAT Through Compilation and Projection
Conformant planning is a variation of classical AI planning where the initial state is partially known and actions can have nondeterministic effects. While a classical plan must achieve the goal from a given initial state using deterministic actions, a conformant plan must achieve the goal in the presence of uncertainty in the initial state and action effects. Conformant planning is computation...
متن کاملConformant Planning via Heuristic Forward Search
Conformant planning is the task of generating plans given uncertainty about the initial state and action effects, and without any sensing capabilities during plan execution. The plan should be successful regardless of which particular initial state we are in. This paper is motivated by the observation that (1) Conformant planning without conditional effects can be handled easily by any forward ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1012.2713 شماره
صفحات -
تاریخ انتشار 2010